Efficient Algorithms for Maximum Regression Depth
نویسندگان
چکیده
منابع مشابه
Efficient Algorithms for the Maximum Sum Problems
We present efficient sequential and parallel algorithms for the maximum sum (MS) problem, which is to maximize the sum of some shape in the data array. We deal with two MS problems; the maximum subarray (MSA) problem and the maximum convex sum (MCS) problem. In the MSA problem, we find a rectangular part within the given data array that maximizes the sum in it. The MCS problem is to find a conv...
متن کاملEfficient Algorithms for Outlier-Robust Regression
We give the first polynomial-time algorithm for performing linear or polynomial regression resilient to adversarial corruptions in both examples and labels. Given a sufficiently large (polynomial-size) training set drawn i.i.d. from distribution D and subsequently corrupted on some fraction of points, our algorithm outputs a linear function whose squared error is close to the squared error of t...
متن کاملEfficient Algorithms for the Maximum Convex Sum Problem
his research is designed to develop and investigate newly defined problems: the Maximum Convex Sum (MCS), and its generalisation, the K-Maximum Convex Sum (K-MCS), in a two-dimensional (2D) array based on dynamic programming. The study centres on the concept of finding the most useful informative array portion as defined by different parameters involved in data, which is generically expressed i...
متن کاملEfficient Parallel Algorithms for the Maximum Subarray Problem
Parallel algorithm design is generally hard. Parallel program verification is even harder. We take an example from the maximum subarray problem and and show those two problems of design and verification. The best known communication steps for a mesh architecture for the maximum subarray problem is 2n − 1. We give a formal proof for the parallel algorithm on the mesh architecture based on Hoare ...
متن کاملEfficient heuristic algorithms for maximum utility product pricing problems
We propose improvements to some of the best heuristic algorithms for optimal product pricing problem originally designed by Dobson and Kalish in the late 1980s and in the early 1990s. Our improvements are based on a detailed study of a fundamental decoupling structure of the underlying mixed integer programming (MIP) problem and on incorporating more recent ideas, some from the theoretical comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2007
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-007-9046-6